Rice's Theorem for μ-Limit Sets of Cellular Automata
نویسنده
چکیده
Cellular automata are a parallel and synchronous computing model, made of infinitely many finite automata updating according to the same local rule. Rice’s theorem states that any nontrivial property over computable functions is undecidable. It has been adapted by Kari to limit sets of cellular automata [Kar94], that is the set of configurations that can be reached arbitrarily late. This paper proves a new Rice theorem for μ-limit sets, which are sets of configurations often reached arbitrarily late.
منابع مشابه
Captive Cellular Automata
We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some algebraic properties of the class and show that it contains intrinsically universal cellular automata. In addition we show that Rice’s theorem for limit sets is no longer true for that class, although infinitely many properties o...
متن کاملRevisiting the Rice Theorem of Cellular Automata
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e. the infinite sequences of cell states. The limit set of the cellular automaton is the set of configurations which can be reached arbitrarily late in the evol...
متن کاملThe Nilpotency Problem of One-Dimensional Cellular Automata
The limit set of a celullar automaton consists of all the configurations of the automaton that can appear after arbitrarily long computations. It is known that the limit set is never empty--it contains at least one homogeneous configuration. A CA is called nilpotent if its limit set contains just one configuration. The present work proves that it is algorithmically undecidable whether a given o...
متن کاملConstruction of μ-Limit Sets of Two-Dimensional Cellular Automata
We prove a characterization of μ-limit sets of two-dimensional cellular automata, extending existing results in the one-dimensional case. This sets describe the typical asymptotic behaviour of the cellular automaton, getting rid of exceptional cases, when starting from the uniform measure.
متن کاملOn the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
We study the notion of limit sets of cellular automata associated with probability measures (μ-limit sets). This notion was introduced by P. Kůrka and A. Maass in [1]. It is a refinement of the classical notion of ω-limit sets dealing with the typical long term behavior of cellular automata. It focuses on the words whose probability of appearance does not tend to 0 as time tends to infinity (th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011